#include <bits/stdc++.h>
using namespace std;
unordered_map<long long, long long> mp;
set<int> st;
int main()
{
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    int n, x;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
    {
        cin >> x;
        mp[x]++;
        st.insert(x);
    }
    long long maxn = -1LL;
    for (auto it = st.begin(); it != st.end(); it++)
        maxn = max(maxn, mp[*it]);
    printf("%lld\n", maxn);
    return 0;
}